VELO Module Production - Pitch Adaptor & Chip Gluing

This note describes in detail the procedures used in the gluing of pitch adaptors and chips to the hybrid

VELO Module Production - Front End Bonding

This note describes in detail the procedures used in the bonding of the ASICs (Beetle 1.5 chips) down to the Pitch Adaptors for the LHCb VELO detector modules

VELO Module Production - Sensor End Bonding

This note describes the procedures used in the bonding of the silicon to the pitch adaptors for the LHCb VELO detector modules

VELO Module Production - Back End Bonding

This note describes in detail the procedures used in the bonding of the ASICs (Beetle 1.5 chips) to the hybrid for the LHCb VELO detector modules

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most $k$. Ban and Linial conjectured that every bridgeless cubic graph admits a $2$-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph $G$ with $|E(G)| \equiv 0 \pmod 2$ has a $2$-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying $2$-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio

Endoscopic orbital decompression for Graves' ophthalmopathy

Graves’ disease may occasionally result in significant proptosis that is either cosmetically unacceptable or causes visual loss. This has traditionally been managed surgically by external decompression of the orbital bony skeleton. Trans-nasal endoscopic orbital decompression is emerging as a new minimally-invasive technique, that avoids the need for cutaneous or gingival incisions. Decompression of the medial orbital wall can be performed up to the anterior wall of the sphenoid sinus. This can be combined with resection of the medial and posterior portion of the orbital floor (preserving the infra-orbital nerve). This technique produces decompression which is comparable to external techniques. We present a series of 10 endoscopic orbital decompressions with an average improvement of 4.4 mm in orbital proptosis. There was an improvement in visual acuity in all patients with visual impairment. Endoscopic orbital decompression is recommended as an alternative to traditional decompression techniques.Desmond T. H. Wee, A. Simon Carney, Mark Thorpe and Peter J. Wormal

An algorithm for counting circuits: application to real-world and random graphs

We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world networks, it allows to estimate exponentially large numbers of circuits in polynomial time. We illustrate the method by studying a graph of the Internet structure.Comment: 7 pages, 3 figures, minor corrections, accepted versio